The diameter of paired-domination vertex critical graphs
نویسندگان
چکیده
منابع مشابه
Diameter of paired domination edge-critical graphs
A paired dominating set of a graph G without isolated vertices is a dominating set of G whose induced subgraph has a perfect matching. The paired domination number γpr(G) of G is the minimum cardinality amongst all paired dominating sets of G. The graph G is paired domination edge-critical (γprEC) if for every e ∈ E(G), γpr(G+ e) < γpr(G). We investigate the diameter of γprEC graphs. To this ef...
متن کاملOn the diameter of total domination vertex critical graphs
In this paper, we consider various types of domination vertex critical graphs, including total domination vertex critical graphs and independent domination vertex critical graphs and connected domination vertex critical graphs. We provide upper bounds on the diameter of them, two of which are sharp. MSC (2010): 05C12, 05C69
متن کاملThe diameter of total domination vertex critical graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. These graphs we call γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We characterize the connected graphs with minimum degree one t...
متن کاملThe diameter of total domination and independent domination vertex-critical graphs
We show that the diameter of a total domination vertex-critical graph is at most 5(γt −1)/3, and that the diameter of an independent domination vertex-critical graph is at most 2(i− 1). For all values of γt ≡ 2 (mod 3) there exists a total domination vertex-critical graph with the maximum possible diameter. For all values of i ≥ 2 there exists an independent domination vertex-critical graph wit...
متن کاملMajority domination vertex critical graphs
This paper deals the graphs for which the removal of any vertex changes the majority domination number of the graph. In the following section, how the removal of a single vertex fromG can change the majority domination number is surveyed for trees. Characterisation of V + M (G) and V − M (G) are determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2008
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-008-0057-0